The discrete fractional Fourier transform based on the DFT matrix

We introduce a new discrete fractional Fourier transform (DFrFT) based on only the DFT matrix and its powers. Eigenvectors of the DFT matrix are obtained in a simple-yetelegant and straightforward manner. We show that this DFrFT definition based on the eigentransforms of the DFT matrix mimics the properties of continuous fractional Fourier transform (FrFT) by approximating the samples of the continuous FrFT. By appropriately combining existing commuting matrices we obtain a new commuting matrix which performs better. We show the validity of the proposed algorithms by computer simulations comparing DFrFT points and continuous FrFT samples for various signals. & 2010 Elsevier B.V. All rights reserved.